A method for solving interval type-2 triangular fuzzy bilevel linear programming problem

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

A new method for solving fully fuzzy linear Bilevel programming problems

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

Solving multi objective linear Bilevel multi follower programming problem

a new method for solving fully fuzzy linear bilevel programming problems

in this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear bilevel programming (fflblp) problems by representing all the parameters as triangular fuzzy numbers. in the proposed method, the given fflblp problem is decomposed into three crisp linear programming (clp) problems with bounded variables constraints, the three clp problems are solved separately and...